A Cost/Speed/Reliability Tradeoff to Erasing
نویسنده
چکیده
We present a Kullback–Leibler (KL) control treatment of the fundamental problem of erasing a bit. We introduce notions of reliability of information storage via a reliability timescale τr, and speed of erasing via an erasing timescale τe. Our problem formulation captures the tradeoff between speed, reliability, and the KL cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least log 2− log ( 1− e− τe τr ) > log 2, which goes to 1 2 log 2τr τe when τr >> τe.
منابع مشابه
A Cost/ Speed/ Reliability Trade-off in Erasing a Bit
We present a novel treatment of the fundamental problem of erasing a bit. We propose a cost function that extends to path space the principle due to Szilard and Landauer that erasing a bit requires at least kBT log 2 units of energy. We introduce notions of reliability of information storage via a reliability timescale τr, and speed of erasing via an erasing timescale τe. Our problem formulatio...
متن کاملDesigning the optimal bit: balancing energetic cost, speed and reliability
We consider the challenge of operating a reliable bit that can be rapidly erased. We find that both erasing and reliability times are non-monotonic in the underlying friction, leading to a trade-off between erasing speed and bit reliability. Fast erasure is possible at the expense of low reliability at moderate friction, and high reliability comes at the expense of slow erasure in the underdamp...
متن کاملمدل هزینه جهت تعیین دوره ضمانت قطعات سری
Customer care and warranty options have become one of critical components of marketing. However, the warranty is known as an indication of quality, but Warranty in its basic assumptions is a procedure to handle the product cost tradeoff on its life cycle between producer, retailer and customer. Time – cost trade off from customer point of view versus reliability-cost tradeoff, as a producer/r...
متن کاملAsymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate singletrial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/thr...
متن کاملEffects of Project Uncertainties on Nonlinear Time-Cost Tradeoff Profile
This study presents the effects of project uncertainties on nonlinear time-cost tradeoff (TCT) profile of real life engineering projects by the fusion of fuzzy logic and artificial neural network (ANN) models with hybrid meta-heuristic (HMH) technique, abridged as Fuzzy-ANN-HMH. Nonlinear time-cost relationship of project activities is dealt with ANN models. ANN models are then integrated with ...
متن کامل